New closed-form bounds on the partition function
نویسندگان
چکیده
منابع مشابه
Closed-Form Bounds for the Rice $Ie$-Function
This work is devoted in the derivation of novel upper and lower bounds for the Rice Ie-function. These bounds are expressed in closed-form and are shown to be quite tight. This is particularly evident by the fact that for a certain range of parameter values, the derived lower bound virtually behaves as a remarkably accurate approximation. As a result, the offered expressions can be considered u...
متن کاملClosed Form Absorption Time Bounds
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this class and we provide the closed form solution for their absorption time distributions. By constructing upper and lower bounding chains that belong to this particular class one can easily compute both lower and upper bound...
متن کاملOn Elementary Lower Bounds for the Partition Function
We present two analogues of two well-known elementary arguments for a lower bound for p(n), the number of partitions of the integer n. One of these is character-theoretic, and the other relies on partition combinatorics developed and used in the theory of representations of the symmetric group. We show that these arguments provide better lower estimates. We also give an application.
متن کاملDensity Propagation and Improved Bounds on the Partition Function
Given a probabilistic graphical model, its density of states is a distribution that, for any likelihood value, gives the number of configurations with that probability. We introduce a novel message-passing algorithm called Density Propagation (DP) for estimating this distribution. We show that DP is exact for tree-structured graphical models and is, in general, a strict generalization of both s...
متن کاملCost Allocation in Partition Function Form Games
A cooperative game in partition function form is proposed for a cost allocation problem. The game describes a real situation in which a payoff of any coalition does not only depend on the players in the coalition but also on the coalition structure of the other players. Solution concepts like the stable set and the core are analyzed. Relations of the concepts in the case of the game in partitio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2008
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-008-5072-8